A Simplification Method of Polymorphic Boolean Functions
نویسندگان
چکیده
Polymorphic circuits are a special kind of circuits which possess multiple build-in functions, and these functions are activated by environment parameters, like temperature, light and VDD. The behavior of a polymorphic circuit can be described by a polymorphic Boolean function. For the first time, this brief presents a simplification method of the polymorphic Boolean function.
منابع مشابه
Fast Karnough Map for Simplification of Complex Boolean Functions
In this paper a new fast simplification method is presented. Such method realizes karnough map with large number of variables. In order to accelerate the operation of the proposed method, a new approach for fast detection of group of ones is presented. Such approach implemented in the frequency domain. The search operation relies on performing cross correlation in the frequency domain rather th...
متن کاملA Fast Computerized Method For Automatic Simplification of Boolean Functions
This paper introduces a new fast systematic method for minimization of the Boolean functions. This method is a very simple because there is no need for any visual representation such as Karnough map or arrangement technique such as Tabulation method and is very easy for programming. Furthermore, it is very suitable for boolean function with large number of variables (more than 4 variable). In a...
متن کاملIntegrating Fast Karnough Map and Modular Neural Networks for Simplification and Realization of Complex Boolean Functions
In this paper a new fast simplification method is presented. Such method realizes Karnough map with large number of variables. In order to accelerate the operation of the proposed method, a new approach for fast detection of group of ones is presented. Such approach implemented in the frequency domain. The search operation relies on performing cross correlation in the frequency domain rather th...
متن کاملIntegrating Fast Karnough Map and Modular Neural Networks for Simplification and Realization of Complex Boolean Functions
In this paper a new fast simplification method is presented. Such method realizes Karnough map with large number of variables. In order to accelerate the operation of the proposed method, a new approach for fast detection of group of ones is presented. Such approach implemented in the frequency domain. The search operation relies on performing cross correlation in the frequency domain rather th...
متن کاملTowards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiability problems for Boolean circuits is devised. The method employs a direct cut rule combined with deterministic deduction rules. Simplification rules for circuits and a search heuristic attempting to minimize the search ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1709.03066 شماره
صفحات -
تاریخ انتشار 2017